Perfect state transfer over distance-regular spin networks
نویسنده
چکیده
By considering distance-regular graphs as spin networks, first we introduce some particular spin Hamiltonians which are extended version of those of Refs.[1, 2]. Then, by using spectral analysis techniques and algebraic combinatoric structure of distanceregular graphs such as stratification introduced in [3, 4] and Bose-Mesner algebra, we give a method for finding a set of coupling constants in the Hamiltonians so that a particular state initially encoded on one site of a network will evolve freely to the opposite site without any dynamical controls, i.e., we show that how to derive the parameters of the system so that perfect state transfer (PST) can be achieved. As examples, the cycle networks with even number of vertices and d-dimensional hypercube networks are considered in details and the method is applied for some important distance-regular networks in appendix.
منابع مشابه
Perfect state transfer of a qudit over underlying networks of group association schemes
As generalizations of results of Christandl et al.[1, 2] and Facer et al.[3], Bernasconi et al.[4, 5] studied perfect state transfer (PST) between two particles in quantum networks modeled by a large class of cubelike graphs (e.g., the hypercube) which are the Cayley graphs of the elementary abelian group Zn 2 . In Refs. [6, 7], respectively, PST of a qubit over distance regular spin networks a...
متن کاملPerfect state transfer in quantum spin networks.
We propose a class of qubit networks that admit the perfect state transfer of any quantum state in a fixed period of time. Unlike many other schemes for quantum computation and communication, these networks do not require qubit couplings to be switched on and off. When restricted to N-qubit spin networks of identical qubit couplings, we show that 2log3N is the maximal perfect communication dist...
متن کاملPerfect transference of a d-level quantum state over pseudo-distance-regular networks
Following the prescription of Ref. [1] in which perfect state transference (PST) of a qubit over distance regular spin networks was discussed, in this paper PST of an arbitrary d-level quantum state (qudit) over antipodes of more general networks called pseudo distance-regular networks, is investigated. In fact, the spectral analysis techniques used in the previous work [1], and algebraic struc...
متن کاملQuantum computing with spin networks
We present a class of spin networks that act as perfect quantum wires—quantum states transfer across these networks with unit fidelity in a time proportional to the network’s size. No couplings need to be switched on and off during this process. We prove that N-spin hypercube networks with equal-strength nearest-neighbor Heisenberg and XY couplings have a maximal perfect communication distance ...
متن کاملPerfect quantum state transfer with spinor bosons on weighted graphs.
A duality between the properties of many spinor bosons on a regular lattice and those of a single particle on a weighted graph reveals that a quantum particle can traverse an infinite hierarchy of networks with perfect probability in polynomial time, even as the number of nodes increases exponentially. The one-dimensional "quantum wire" and the hypercube are special cases in this construction, ...
متن کامل